Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
201	Conflict-Guided Simplification for SAT Michael L. Case1,2 , Sanjit A. Seshia1 , Alan Mishchenko1 , and Robert K. Brayton1 1 2 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-01-31 13:42:07 Logic in computer science NP-complete problems Automated theorem proving Constraint programming Electronic design automation Boolean satisfiability problem Resolution Conjunctive normal form Satisfiability Modulo Theories Theoretical computer science Mathematics Applied mathematics
202	Symmetry Detection for Large Boolean Functions using Circuit Representation, Simulation, and Satisfiability Jin S. Zhang1 Alan Mishchenko2 Robert Brayton2 Malgorzata Chrzanowska-Jeske1 1 Department of ECE Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2006-05-08 11:02:36 Electronic engineering Electronic design automation Formal methods Diagrams Symmetry And-inverter graph Binary decision diagram Boolean satisfiability problem Symmetry in mathematics Mathematics Theoretical computer science Boolean algebra
203	Board-Level Multiterminal Net Assignment Xiaoyu Song1, William N. N. Hung2, Alan Mishchenko1, Malgorzata Chrzanowska-Jeske1, Alan Coppola3 and Andrew Kennings4 1 Department of ECE, Portland State University, Portland, O Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2002-03-01 13:11:46 Applied mathematics Logic in computer science NP-complete problems Formal methods Boolean algebra Boolean satisfiability problem Field-programmable gate array Conjunctive normal form Routing Theoretical computer science Electronic engineering Electronic design automation
204	IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 25, NO. 5, MAY[removed]Using Simulation and Satisfiability to Compute Flexibilities in Boolean Networks Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2006-11-01 22:55:48 Mathematical logic Algebraic logic Logic Diagrams Formal methods Binary decision diagram Canonical form Circuit Boolean satisfiability problem Theoretical computer science Boolean algebra Mathematics
205	SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko and Robert K. Brayton Department of EECS University of California, Berkeley {alanmi, brayton}@eecs.berkeley.edu Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2004-12-03 17:46:16 Boolean algebra Electronic design automation Formal methods Bioinformatics Boolean network Logic Boolean satisfiability problem Circuit Model checking Theoretical computer science Applied mathematics Mathematics
206	Logic Synthesis for Regular Layout using Satisfiability Marek Perkowski and Alan Mishchenko Department of Electrical and Computer Engineering Portland State University Portland, OR 97207, USA [mperkows, alanmi]@ece.pdx.e Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2002-05-01 01:40:28 Theoretical computer science Electronic design automation Diagrams Formal methods Lattice theory Binary decision diagram Boolean satisfiability problem Logic synthesis Lattice Abstract algebra Mathematics Boolean algebra
207	Improvements to Combinational Equivalence Checking Alan Mishchenko Satrajit Chatterjee Robert Brayton Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2006-08-09 21:17:37 Formal methods Logic in computer science NP-complete problems And-inverter graph Diagrams Boolean satisfiability problem Satisfiability Logic synthesis Automatic test pattern generation Electronic engineering Theoretical computer science Electronic design automation
208	Cut-Based Inductive Invariant Computation Michael Case1,2 1 Alan Mishchenko1 Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-04-28 18:02:46 Formal methods Logic in computer science Electronic design automation Mathematical logic Programming paradigms And-inverter graph Logic programming Model checking Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
209	SAT-Based Complete Don’t-Care Computation for Network Optimization Alan Mishchenko Department of EECS University of California, Berkeley [removed] Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2004-04-30 02:47:03 Boolean algebra Computing Formal methods Electronic design automation Boolean satisfiability problem Boolean network Model checking Canonical form Lookup table Theoretical computer science Logic Mathematics
210	Microsoft Word - imfs27.doc Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2008-12-20 12:21:03 Formal methods Mathematics Logic Boolean algebra Diagrams And-inverter graph Boolean satisfiability problem Canonical form Lookup table Theoretical computer science Computing Electronic design automation

UPDATE